Lecture Notes on Solving Large Scale Eigenvalue Problems
نویسنده
چکیده
منابع مشابه
یک الگوریتم کارا برای زیر مسالهی ناحیه اطمینان توسیع یافته با دو قید خطی
Trust region subproblem (TRS), which is the problem of minimizing a quadratic function over a ball, plays a key role in solving unconstrained nonlinear optimization problems. Though TRS is not necessarily convex, there are efficient algorithms to solve it, particularly in large scale. Recently, extensions of TRS with extra linear constraints have received attention of several researchers. It ha...
متن کاملSolving Large-scale Eigenvalue Problems in SciDAC Applications
Large-scale eigenvalue problems arise in a number of DOE applications. This paper provides an ovcrvicw of thc recent dcvclopriicrit of cigciivaluc computation in the coritcxt of two SciDAC applications. We emphasize the importance of Krylov suhspace methods, and point out its limitations. M7e discuss the value of alternative approaches that are more amenable to the use of prcconditioncrs, arid ...
متن کاملA New Play-off Approach in League Championship Algorithm for Solving Large-Scale Support Vector Machine Problems
There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algori...
متن کاملLecture 14: Eigenvalue Computations
This lecture discusses a few numerical methods for the computation of eigenvalues and eigenvectors of matrices. Most of this lecture will focus on the computation of a few eigenvalues of a large symmetric matrix, but some nonsymmetric matrices also will be considered, including the Google matrix. The QRalgorithm for both symmetric and nonsymmetric matrices of small to modest size will be discus...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کامل